منابع مشابه
A Bayesian boosting theorem
We re®ne the ®rst theorem of (R. bounding the error of the ADA DABOOST OOST boosting algorithm, to integrate Bayes risk. This suggests the signi®cant time savings could be obtained on some domains without damaging the solution. An applicative example is given in the ®eld of feature selection.
متن کاملBoosting with Bayesian stumps
SUMMARY Boosting is a new, powerful method for classiication. It is an iterative procedure which successively classiies a weighted version of the sample, and then reweights this sample dependent on how successful the classiication was. In this paper we review some of the commonly used methods for performing boosting and show how they can be t into a Bayesian setup at each iteration of the algor...
متن کاملBoosting and Naive Bayesian Learning
Although so-called “naive” Bayesian classification makes the unrealistic assumption that the values of the attributes of an example are independent given the class of the example, this learning method is remarkably successful in practice, and no uniformly better learning method is known. Boosting is a general method of combining multiple classifiers due to Yoav Freund and Rob Schapire. This pap...
متن کاملBoosting the differences: A fast Bayesian classifier neural network
A Bayesian classifier that up-weights the differences in the attribute values is discussed. Using four popular datasets from the UCI repository, some interesting features of the network are illustrated. The network is suitable for classification problems.
متن کاملA Note on the PAC Bayesian Theorem
We prove general exponential moment inequalities for averages of [0,1]valued iid random variables and use them to tighten the PAC Bayesian Theorem. The logarithmic dependence on the sample count in the enumerator of the PAC Bayesian bound is halved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2001
ISSN: 0167-8655
DOI: 10.1016/s0167-8655(00)00137-9